#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using i128 = __int128;
const int N = 1e6 + 5;

int n, a, b;
vector<int> w(n);

bool check(int mid) {
    ll cnt = 0;
    for (int wi : w) {
        ll ori = (ll)a * mid;
        if (ori < wi) {
            ll need = (wi - ori + b - 1) / b;
            cnt += need;
            if (cnt > mid) return false;
        }
    }
    return cnt <= mid;
}

void solve() {
    cin >> n >> a >> b;
    w.resize(n);
    for (int i = 0; i < n; i++) cin >> w[i];
    int l = 0, r = N;
    ll ans=0;
    while (l <= r) {
        int mid = l + (r - l) / 2;
        if (check(mid)) {
            ans=mid;
            r=mid-1;
        }else{
            l=mid+1;
        }
    }
    cout<<ans<<endl;
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    solve();

    return 0;
}